Compound conditionals, Fréchet-Hoeffding bounds, and Frank t-norms
نویسندگان
چکیده
In this paper we consider compound conditionals, Fr\'echet-Hoeffding bounds and the probabilistic interpretation of Frank t-norms. By studying solvability suitable linear systems, show under logical independence sharpness for prevision conjunctions disjunctions $n$ conditional events. We study set all coherent assessments on a family containing events their conjunction, by verifying that it is convex. discuss case where assessed Lukasiewicz t-norms give explicit solutions systems; then, analyze selected example. obtain t-conorms as events, respectively. Then, characterize sets or disjunction, using t-norms, t-conorms. assuming independence, any t-norm (resp., t-conorm) two $A|H$ $B|K$, $T_{\lambda}(A|H,B|K)$ $S_{\lambda}(A|H,B|K)$), conjunction $(A|H)\wedge (B|K)$ disjunction $(A|H)\vee (B|K)$). considering $\mathcal{F}$ three pairwise some results coherence $\mathcal{F}$. to assess previsions means Minimum Product verify counterexample that, when are t-norm, not assured.
منابع مشابه
Nearly Frank T-norms and the Characterization of T-measures
We introduce nearly Frank t-norms as t-norms which are generated from Frank t-norms by means of a negation-preserving automorphism. We state basic properties of nearly Frank t-norms and we show their speci c role in the characterization of T -measures. 1 Basic facts about T -norms A t-norm (fuzzy conjunction) is a binary operation T : [0; 1]2 ! [0; 1] which is commutative, associative, nondecre...
متن کاملDomination in the families of Frank and Hamacher t-norms
Domination is a relation between general operations defined on a poset. The old open problem is whether domination is transitive on the set of all t-norms. In this paper we contribute partially by inspection of domination in the family of Frank and Hamacher tnorms. We show that between two different t-norms from the same family, the domination occurs iff at least one of the t-norms involved is ...
متن کاملDeontic norms, deontic reasoning, and deontic conditionals
Deontic reasoning is thinking about whether actions are forbidden or allowed, obligatory or not obligatory. It is proposed that social norms, imposing constraints on individual actions, constitute the fundamental concept for the system of these four deontic modalities, and that people reason from such norms flexibly according to deontic core principles. Two experiments are presented, one on deo...
متن کاملChernoff-Hoeffding Bounds for Markov Chains: Generalized and Simplified
We prove the first Chernoff-Hoeffding bounds for general (nonreversible) finite-state Markov chains based on the standard L1 (variation distance) mixing-time of the chain. Specifically, consider an ergodic Markov chain M and a weight functionf : [n] → [0, 1] on the state space [n] of M with mean μ , Ev←π[f(v)], where π is the stationary distribution of M . A t-step random walk (v1, . . . , vt) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2021
ISSN: ['1873-4731', '0888-613X']
DOI: https://doi.org/10.1016/j.ijar.2021.06.006